Derivation in Scattered Context Grammar via Lazy Function Evaluation
نویسندگان
چکیده
This paper discusses scattered context grammars (SCG) and considers the application of scattered context grammar production rules. We use function that represents single derivation step over the given sentential form. Moreover, we define this function in such a way, so that it represents the delayed execution of scattered context grammar production rules using the same principles as a lazy evaluation in functional programming. Finally, we prove equivalence of the usual and the delayed execution of SCG production rules.
منابع مشابه
k-Limited Erasing Performed by Scattered Context Grammars
A scattered context grammar, G, erases nonterminals in a k-limited way, where k≥ 1, if in every sentential form of any derivation, between every two symbols from which G derives non-empty strings, there occur no more than k nonterminals from which G derives empty words. This paper demonstrates that any scattered context grammar that erases nonterminals in this way can be converted to an equival...
متن کاملTwo Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars
The present paper introduces and discusses generalized scattered context grammars that are based upon sequences of productions whose left-hand sides are formed by nonterminal strings, not just single nonterminals. It places two restrictions on the derivations in these grammars. More specifically, let k be a positive integer. The first restriction requires that all rewritten symbols occur within...
متن کاملEfficient and Robust LFG Parsing: SxLFG
In this paper, we introduce a new parser, called SXLFG, based on the LexicalFunctional Grammars formalism (LFG). We describe the underlying context-free parser and how functional structures are efficiently computed on top of the CFG shared forest thanks to computation sharing, lazy evaluation, and compact data representation. We then present various error recovery techniques we implemented in o...
متن کاملIWPT - 05 Proceedings of the Ninth
In this paper, we introduce a new parser, called SXLFG, based on the LexicalFunctional Grammars formalism (LFG). We describe the underlying context-free parser and how functional structures are efficiently computed on top of the CFG shared forest thanks to computation sharing, lazy evaluation, and compact data representation. We then present various error recovery techniques we implemented in o...
متن کاملLazy Combinators for Executable Specifications of General Attribute Grammars
A lazy-evaluation based top-down parsing algorithm has been implemented as a set of higher-order functions (combinators) which support directly-executable specifications of fully general attribute grammars. This approach extends aspects of previous approaches, and allows natural language processors to be constructed as modular and declarative specifications while accommodating ambiguous context...
متن کامل